Multiple DNA Sequence Alignment Based on Genetic Simulated Annealing Techniques

نویسندگان

  • Shyi-Ming Chen
  • Chung-Hui Lin
چکیده

Multiple DNA sequence alignment is an important research topic of bioinformatics. In this paper, we present a new method for multiple DNA sequence alignment, based on genetic simulated annealing techniques, to choose the best cutting point set of the multiple DNA sequence set. The experimental results show that the proposed method gets higher scores and more match columns than the method presented in [3] for dealing with the multiple DNA sequence alignment problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple Sequence Alignment Using Optimization Algorithms

Proteins or genes that have similar sequences are likely to perform the same function. One of the most widely used techniques for sequence comparison is sequence alignment. Sequence alignment allows mismatches and insertion/deletion, which represents biological mutations. Sequence alignment is usually performed only on two sequences. Multiple sequence alignment, is a natural extension of two-se...

متن کامل

Visualization and Interactive Steering of Simulated Annealing

Combinatorial optimization problems involve the selection of an arrangement of discrete objects (a state) from a discrete, nite space of mutually exclusive states. The goal is to select the particular state that represents the extremization (maximization or minimization) of an objective function. Often, these problems are simple to state, but quite diicult to solve. Exact solution methods, whil...

متن کامل

An Efficient Method for Multiple Sequence Alignment

Multiple sequence alignment has been a useful method in the study of molecular evolution and sequence-structure relationships. This paper presents a new method for multiple sequence alignment based on simulated annealing technique. Dynamic programming has been widely used to find an optimal alignment. However, dynamic programming has several limitations to obtain optimal alignment. It requires ...

متن کامل

Multiple Alignment Using Hidden Markov Models

A simulated annealing method is described for training hidden Markov models and producing multiple sequence alignments from initially unaligned protein or DNA sequences. Simulated annealing in turn uses a dynamic programming algorithm for correctly sampling suboptimal multiple alignments according to their probability and a Boltzmann temperature factor. The quality of simulated annealing alignm...

متن کامل

Alignment of possible secondary structures in multiple RNA sequences using simulated annealing

Multiple sequence alignment has been a useful technique for identifying RNA secondary structures. In this paper, an algorithm for aligning multiple RNA sequences to identify possible secondary structure is presented. In this algorithm, dot matrices generated from intra-sequence comparisons are used to obtain possible common secondary structures. A hit probability for dot matrices is calculated ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005